Cambridge Tracts in

ion rule, 137activated T-component, 107allocation, 73allocated transition, 73Allocation Lemma, 74circuit-free allocation, 76Circuit-free Allocation Lemma, 76cyclic, 102Cyclic Allocation Lemma, 102pointing, 117Pointing Allocation Lemma, 118sequence that agrees with, 74total, 73alphabet, 15applicable rule, 136asymmetric-choice net, 207asymmetric-chice system, 207atomic net, 136 behavioural property, 9Biased Sequence Lemma, 58biased sequence, 55Bipolar Synchronization Schemes, 167boundedness, 266-boundedness, 26bound of a place, 26bounded marking, 26Boundedness Lemma, 27Boundedness Theoremfor S-systems, 43for T-systems, 50 causal relation, 4characteristic function, 13Church-Rosser property, 206circuit, 17circuit-free allocation, 76Circuit-free Allocation Lemma, 76marked, 47initially, 47regulation, 123token count of, 47cluster, 65feedback of, 216regulation circuit of, 96fundamental property of free-choicenets in terms of, 66Commoner's Theorem,' if direction, 72'only i f direction, 78complete kit, 136Completeness Theorem, 158concurrency relation, 4conditions of application of a rule, 137conflict order, 195conflict order that agrees with asequence, 197conflict relation, 4conflict-free system, 61confluence property, 170Confluence TheoremFirst, 171Second, 193connectedness, 17cover, 91,101CP-subnet, 150fundamental property of, 151cyclic allocation, 102Cyclic Allocation lemma, 102